Genome analysis with inter-nucleotide distances
نویسندگان
چکیده
منابع مشابه
Genome analysis with inter-nucleotide distances
MOTIVATION DNA sequences can be represented by sequences of four symbols, but it is often useful to convert the symbols into real or complex numbers for further analysis. Several mapping schemes have been used in the past, but they seem unrelated to any intrinsic characteristic of DNA. The objective of this work was to find a mapping scheme directly related to DNA characteristics and that would...
متن کاملInter-dinucleotide distances in the human genome: an analysis of the whole-genome and protein-coding distributions
We study the inter-dinucleotide distance distributions in the human genome, both in the whole-genome and protein-coding regions. The inter-dinucleotide distance is defined as the distance to the next occurrence of the same dinucleotide. We consider the 16 sequences of inter-dinucleotide distances and two reading frames. Our results show a period-3 oscillation in the protein-coding inter-dinucle...
متن کاملGenome analysis with distance to the nearest dissimilar nucleotide.
DNA may be represented by sequences of four symbols, but it is often useful to convert those symbols into real or complex numbers for further analysis. Several mapping schemes have been used in the past, but most of them seem to be unrelated to any intrinsic characteristic of DNA. The objective of this work was to study a mapping scheme that is directly related to DNA characteristics, and that ...
متن کاملA dynamic model for inter-agent distances
We study the emergence of macro-level dynamic structures as a result of simple interacting rules among agents. Our model is based on some specific cellular automata principles and simulates spatial behaviors. It is a dynamic model where agents move on a lattice –space or universesearching to minimize a dissatisfaction, or objective, function. Agents have psychological traits (e.g., attention an...
متن کاملAdvances on Genome Duplication Distances
Given a phylogenetic tree involving Whole Genome Duplication events, we contribute to the problem of computing the rearrangement distance on a branch of a tree linking a duplication node d to a speciation node or a leaf s. In the case of a genome G at s containing exactly two copies of each gene, the genome halving problem is to find a perfectly duplicated genome D at d minimizing the rearrange...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2009
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btp546